A Novel Model of Working Set Selection for SMO Decomposition Methods

In the process of training Support Vector Machines (SVMs) by decomposition methods, working set selection is an important technique, and some exciting schemes were employed into this field. To improve working set selection, we propose a new model for working set selection in sequential minimal optimization (SMO) decomposition methods. In this model, it selects B as working set without reselection. Some properties are given by simple proof, and experiments demonstrate that the proposed method is in general faster than existing methods.Comment: 8 pages, 12 figures, it was submitted to IEEE International conference of Tools on Artificial Intelligenc

State estimation for one-dimensional agro-hydrological processes with model mismatch

The importance of accurate soil moisture data for the development of modern closed-loop irrigation systems cannot be overstated. Due to the diversity of soil, it is difficult to obtain an accurate model for agro-hydrological system. In this study, soil moisture estimation in 1D agro-hydrological systems with model mismatch is the focus. To address the problem of model mismatch, a nonlinear state-space model derived from the Richards equation is utilized, along with additive unknown inputs. The determination of the number of sensors required is achieved through sensitivity analysis and the orthogonalization projection method. To estimate states and unknown inputs in real-time, a recursive expectation maximization (EM) algorithm derived from the conventional EM algorithm is employed. During the E-step, the extended Kalman filter (EKF) is used to compute states and covariance in the recursive Q-function, while in the M-step, unknown inputs are updated by locally maximizing the recursive Q-function. The estimation performance is evaluated using comprehensive simulations. Through this method, accurate soil moisture estimation can be obtained, even in the presence of model mismatch

State Estimation for Nonlinear Discrete-Time Systems with Markov Jumps and Nonhomogeneous Transition Probabilities

State estimation problem is addressed for a class of nonlinear discrete-time systems with Markov parameters and nonhomogeneous transition probabilities (TPs). In this paper, the optimal estimation mechanism of transition probability matrix is proposed in the minimum mean square error sense to show some critical points. Based on this mechanism, the extended Kalman filters are employed as the subfilters to obtain the subestimates with corresponding models. A novel operator which fuses the prior knowledge and the posterior information embedded in observations is developed to modify the posterior mode probabilities. A meaningful example is presented to illustrate the effectiveness of our method

Optimal State Estimation for Discrete-Time Markov Jump Systems with Missing Observations

This paper is concerned with the optimal linear estimation for a class of direct-time Markov jump systems with missing observations. An observer-based approach of fault detection and isolation (FDI) is investigated as a detection mechanic of fault case. For systems with known information, a conditional prediction of observations is applied and fault observations are replaced and isolated; then, an FDI linear minimum mean square error estimation (LMMSE) can be developed by comprehensive utilizing of the correct information offered by systems. A recursive equation of filtering based on the geometric arguments can be obtained. Meanwhile, a stability of the state estimator will be guaranteed under appropriate assumption

Impact of Human-AI Interaction on User Trust and Reliance in AI-Assisted Qualitative Coding

While AI shows promise for enhancing the efficiency of qualitative analysis, the unique human-AI interaction resulting from varied coding strategies makes it challenging to develop a trustworthy AI-assisted qualitative coding system (AIQCs) that supports coding tasks effectively. We bridge this gap by exploring the impact of varying coding strategies on user trust and reliance on AI. We conducted a mixed-methods split-plot 3x3 study, involving 30 participants, and a follow-up study with 6 participants, exploring varying text selection and code length in the use of our AIQCs system for qualitative analysis. Our results indicate that qualitative open coding should be conceptualized as a series of distinct subtasks, each with differing levels of complexity, and therefore, should be given tailored design considerations. We further observed a discrepancy between perceived and behavioral measures, and emphasized the potential challenges of under- and over-reliance on AIQCs systems. Additional design implications were also proposed for consideration.Comment: 27 pages with references, 9 figures, 5 table

Unbiased, optimal, and in-betweens: the trade-off in discrete finite impulse response filtering

In this survey, the authors examine the trade-off between the unbiased, optimal, and in-between solutions in finite impulse response (FIR) filtering. Specifically, they refer to linear discrete real-time invariant state-space models with zero mean noise sources having arbitrary covariances (not obligatorily delta shaped) and distributions (not obligatorily Gaussian). They systematically analyse the following batch filtering algorithms: unbiased FIR (UFIR) subject to the unbiasedness condition, optimal FIR (OFIR) which minimises the mean square error (MSE), OFIR with embedded unbiasedness (EU) which minimises the MSE subject to the unbiasedness constraint, and optimal UFIR (OUFIR) which minimises the MSE in the UFIR estimate. Based on extensive investigations of the polynomial and harmonic models, the authors show that the OFIR-EU and OUFIR filters have higher immunity against errors in the noise statistics and better robustness against temporary model uncertainties than the OFIR and Kalman filters

Semi−Supervised Hybrid Modeling of the Yeast Fermentation Process

This study focuses on modeling the yeast fermentation process using the hybrid modeling method. To improve the prediction accuracy of the model and reduce the model training time, this paper presents a semi−supervised hybrid modeling method based on an extreme learning machine for the yeast fermentation process. The hybrid model is composed of the mechanism model and the residual model. The residual model is built from the residuals between the real yeast fermentation process and the mechanism model. The residual model is used in parallel with the mechanism model. Considering that the residuals might be related to the inaccurate parameters or structure of the process, the mechanism model output is taken as unlabeled data, and the suitable inputs are selected based on Pearson’s maximum correlation and minimum redundancy criterion (RRPC). Meanwhile, an extreme learning machine is employed to improve the model’s training speed while maintaining the model’s prediction accuracy. Consequently, the proposal proved its efficacy through simulation